Random Sampling of Multivariate Trigonometric Polynomials
نویسندگان
چکیده
We investigate when a trigonometric polynomial p of degree M in d variables is uniquely determined by its sampled values p(xj) on a random set of points xj in the unit cube (the “sampling problem for trigonometric polynomials”) and estimate the probability distribution of the condition number for the associated Vandermonde-type and Toeplitz-like matrices. The results provide a solid theoretical foundation for some efficient numerical algorithms that are already in use.
منابع مشابه
Probability against Condition Number and Sampling of Multivariate Trigonometric Random Polynomials
PROBABILITY AGAINST CONDITION NUMBER AND SAMPLING OF MULTIVARIATE TRIGONOMETRIC RANDOM POLYNOMIALS ALBRECHT BÖTTCHER AND DANIEL POTTS Abstract. The difficult factor in the condition number of a large linear system is the spectral norm of . To eliminate this factor, we here replace worst case analysis by a probabilistic argument. To be more precise, we randomly take from a ball with the uniform ...
متن کاملDeterministic Sampling of Sparse Trigonometric Polynomials
One can recover sparse multivariate trigonometric polynomials from few randomly taken samples with high probability (as shown by Kunis and Rauhut). We give a deterministic sampling of multivariate trigonometric polynomials inspired by Weil’s exponential sum. Our sampling can produce a deterministic matrix satisfying the statistical restricted isometry property, and also nearly optimal Grassmann...
متن کاملMultiple Rank-1 Lattices as Sampling Schemes for Multivariate Trigonometric Polynomials
We present a new sampling method that allows the unique reconstruction of (sparse) multivariate trigonometric polynomials. The crucial idea is to use several rank-1 lattices as spatial discretization in order to overcome limitations of a single rank-1 lattice sampling method. The structure of the corresponding sampling scheme allows for the fast computation of the evaluation and the reconstruct...
متن کاملReconstructing Multivariate Trigonometric Polynomials by Sampling along Generated Sets
The approximation of problems in d spatial dimensions by sparse trigonometric polynomials supported on known or unknown frequency index sets I ⊂ Zd is an important task with a variety of applications. The use of a generalization of rank1 lattices as spatial discretizations offers a suitable possibility for sampling such sparse trigonometric polynomials. Given an index set of frequencies, we con...
متن کاملRandom Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogonal Matching Pursuit (OMP) and Thresholding. While recovery by Basis Pursuit has recently been studied by several authors, we provide theoretical results on the success probability of reconstruction via Thresholding and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Math. Analysis
دوره 36 شماره
صفحات -
تاریخ انتشار 2005